How to compute least infeasible flows

Using DEA to compute most favourable and least favourable sets of weights in ABC inventory classification

A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP

Convex quadratic semidefinite programming (QSDP) has been widely applied in solving engineering and scientific problems such as nearest correlation problems and nearest Euclidean distance matrix problems. In this paper, we study an inexact primal-dual infeasible path-following algorithm for QSDP problems of the form: minX{12X • Q(X) + C •X : A(X) = b, X 0}, where Q is a self-adjoint positive se...

External and Internal Incompressible Viscous Flows Computation using Taylor Series Expansion and Least Square based Lattice Boltzmann Method

The lattice Boltzmann method (LBM) has recently become an alternative and promising computational fluid dynamics approach for simulating complex fluid flows. Despite its enormous success in many practical applications, the standard LBM is restricted to the lattice uniformity in the physical space. This is the main drawback of the standard LBM for flow problems with complex geometry. Several app...

Computational Complexity and Information Asymmetry in Election Audits with Low-Entropy Randomness

We investigate the security of an election audit using a table of random numbers prepared in advance. We show how this scenario can be modeled using tools from combinatorial graph theory and computational complexity theory, and obtain the following results: (1) A randomly generated table can be used to produce a statistically good election audit that requires less randomness to be generated in ...

Performance Isolation in Network and Computing Systems with Multiple Inputs

The growing use of virtualization technologies in settings such as multi-tenant compute and storage clouds challenges us to both specify and enforce the isolation of clients sharing network and compute resources. In this paper we propose a novel analytical measure of performance isolation for shared resource systems serving multiple traffic flows or computing workloads. By basing our isolation ...